Adoption and Termination of Employee Involvement Programs
نویسندگان
چکیده
منابع مشابه
Termination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is, a while loop with linear assignments. We relate the termination of such a simple loop, on all initial values, to the eigenvectors corresponding to only the positive real eigenvalues of the matrix defining the loop a...
متن کاملTermination Of Linear Programs
Many real-time applications have linear programs, which can get a variety of inputs in different situations. It is possible that some of these are “bad” inputs which cause unexpected failures like non-termination of the program. Such instances can lead to disastrous consequences and the programs must be verified to ensure that they either terminate or the inputs under which they don’t terminate...
متن کاملTermination of Monotone Programs
We present an efficient approach to prove termination of monotone programs with integer variables, an expressive class of loops that is often encountered in computer programs. Our approach is based on a lightweight static analysis method and takes advantage of simple properties of monotone functions. Our preliminary implementation shows that our tool has an advantage over existing tools and can...
متن کاملTermination of Polynomial Programs
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical code abstraction and analysis. The technique is based on finite differences of expressions over transition systems. Although no complete method exists for determining termination for this class of loops, we show that our technique is useful in practice. We demonstrat...
متن کاملTermination of Computational Restrictions of Rewriting and Termination of Programs?
Termination of rewriting [Der87,Zan03] is often proposed as a suitable theory for proving termination of programs which are executed by rewriting. Programming languages and systems whose operational principle is based on reduction (e.g., functional, algebraic, and equational programming languages as well as theorem provers based on rewriting techniques) need, however, to break down the non-dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LABOUR
سال: 2011
ISSN: 1121-7081
DOI: 10.1111/j.1467-9914.2010.00510.x